|
In combinatorics, a Graeco-Latin square or Euler square or orthogonal Latin squares of order ''n'' over two sets ''S'' and ''T'', each consisting of ''n'' symbols, is an ''n''×''n'' arrangement of cells, each cell containing an ordered pair (''s'',''t''), where ''s'' is in ''S'' and ''t'' is in ''T'', such that every row and every column contains each element of ''S'' and each element of ''T'' exactly once, and that no two cells contain the same ordered pair. GraecoLatinSquare-Order3.svg|Order 3 GrecoLatinSquare-Order4.svg|Order 4 GraecoLatinSquare-Order5.png|Order 5 The arrangement of the ''s''-coordinates by themselves (which may be thought of as Latin characters) and of the ''t''-coordinates (the Greek characters) each forms a Latin square. A Graeco-Latin square can therefore be decomposed into two "orthogonal" Latin squares. Orthogonality here means that every pair (''s'', ''t'') from the Cartesian product ''S''×''T'' occurs exactly once. ==History== Orthogonal Latin squares have been known to predate Euler. As described by Donald Knuth in Volume 4A, p. 3, of TAOCP, the construction of 4x4 set was published by Jacques Ozanam in 1725 (in ''Recreation mathematiques et physiques'') as a puzzle involving playing cards. The problem was to take all aces, kings, queens and jacks from a standard deck of cards, and arrange them in a 4x4 grid such that each row and each column contained all four suits as well as one of each face value. This problem has several solutions. A common variant of this problem was to arrange the 16 cards so that, in addition to the row and column constraints, each diagonal contains all four face values and all four suits as well. As described by Martin Gardner in ''Gardner's Workout'', the number of distinct solutions to this problem was incorrectly estimated by Rouse Ball to be 72, and persisted many years before it was shown to be 144 by Kathleen Ollerenshaw. Each of the 144 solutions has eight reflections and rotations, giving 1152 solutions in total. The 144x8 solutions can be categorized into the following two classes: For each of the two solutions, 24x24 = 576 solutions can be derived by permuting the four suits and the four face values independently. No permutation will convert the two solutions into each other. The solution set can be seen to be complete through this proof outline: # Without loss of generality, let us choose the card in the top left corner to be . # Now, in the second row, the first two squares can be neither ace nor spades, due to being on the same column or diagonal respectively. Therefore, one of the remaining two squares must be an ace, and the other must be a spade, since the card itself cannot be repeated. # If we choose the cell in the second row, third column to be an ace, and propagate the constraints, we will get Solution #1 above, up to a permutation of the remaining suits and face values. # Conversely, if we choose the (2,3) cell to be a spade, and propagate the constraints, we will get Solution #2 above, up to a permutation of the remaining suits and face values. # Since no other possibilities exist for (2,3), the solution set is complete. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Graeco-Latin square」の詳細全文を読む スポンサード リンク
|